Double circulant codes from two class association schemes
نویسندگان
چکیده
Two class association schemes consist of either strongly regular graphs (SRG) or doubly regular tournaments (DRT). We construct self-dual codes from the adjacency matrices of these schemes. This generalizes the construction of Pless ternary Symmetry codes, Karlin binary Double Circulant codes, Calderbank and Sloane quaternary double circulant codes, and Gaborit Quadratic Double Circulant codes (QDC). As new examples SRG’s give 9 (resp. 29) new Type I (resp. Type II) [72, 36, 12] codes. We construct a [200, 100, 12] Type II code invariant under the Higman-Sims group, a [200, 100, 16] Type II code invariant under the Hall-Janko group, and more generally self-dual binary codes attached to rank three groups.
منابع مشابه
On self-dual double negacirculant codes
Double negacirculant (DN) codes are the analogues in odd characteristic of double circulant codes. Self-dual DN codes of odd dimension are shown to be consta-dihedral. Exact counting formulae are derived for DN codes. The special class of length a power of two is studied by means of Dickson polynomials, and is shown to contain families of codes with relative distances satisfying a modified Gilb...
متن کاملComputational Results of Duadic Double Circulant Codes
Quadratic residue codes have been one of the most important classes of algebraic codes. They have been generalized into duadic codes and quadratic double circulant codes. In this paper we introduce a new subclass of double circulant codes, called duadic double circulant codes, which is a generalization of quadratic double circulant codes for prime lengths. This class generates optimal self-dual...
متن کاملDouble Circulant Codes over <InlineEquation ID="IE1"> <EquationSource Format="MATHTYPE"> <![CDATA[% MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn % hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr % 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9 % vqaqpepm0xbba9pwe9Q8fs0yqaqpepae9pg0FirpepeKkFr0xfr-x % fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWefv3ySLgznf % gDOjdaryqr1ngBPrginfgDObcv39gaiuaacqWFKeIwdaWgaaWcbaGa % aGinaaqabaaaaa!419E! ]]> </EquationSource> <EquationSource Format="TEX"> <![CDATA[$$\mathbb{Z}_4 $$]]> </EquationSource> </InlineEquation> and Even Unimodular Lattices
With the help of some new results about weight enumerators of self-dual codes overZ4 we investigate a class of double circulant codes over Z4, one of which leads to an extremal even unimodular 40-dimensional lattice. It is conjectured that there should be “Nine more constructions of the Leech lattice”.
متن کاملOn extremal double circulant self-dual codes of lengths $90$ and $92$
A classification of extremal double circulant self-dual codes of lengths up to 88 is known. We demonstrate that there is no extremal double circulant self-dual code of length 90. We give a classification of double circulant self-dual [90, 45, 14] codes. In addition, we demonstrate that every double circulant self-dual [90, 45, 14] code has no extremal selfdual neighbor of length 90. Finally, we...
متن کاملNew extremal binary codes of length 66 as extensions of bordered-double-circulant codes over R2
In this work, we extend two extremal codes of length 64 which were obtained by the authors as bordered-double-circulant codes over R2. Using the extension, we have constructed seven new extremal binary codes of length 66 which were not previously known to exist.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Adv. in Math. of Comm.
دوره 1 شماره
صفحات -
تاریخ انتشار 2007